On weighted mean distance

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

Hybrid Recommender System Based on Variance Item Rating

K-nearest neighbors (KNN) based recommender systems (KRS) are among the most successful recent available recommender systems. These methods involve in predicting the rating of an item based on the mean of ratings given to similar items, with the similarity defined by considering the mean rating given to each item as its feature. This paper presents a KRS developed by combining the following app...

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

An iterative approach for estimation of efficiency by weighted distance

Snow water equivalent interpolation for the Colorado River Basin from snow telemetry (SNOTEL) data

[1] Inverse weighted distance and regression nonexact techniques were evaluated for interpolating methods snow water equivalent (SWE) across the entire Colorado River Basin of the western United States. A 1-km spacing was used for the gridding of snow telemetry (SNOTEL) measurements for the years 1993, 1998, and 1999, which on average, represented higher than average, average, and lower than av...